An LS-free splitting method for composite mappings

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Approximation Method for Continuous Pseudocontractive Mappings

LetK be a closed convex subset of a real Banach space E, T : K → K is continuous pseudocontractive mapping, and f : K → K is a fixed L-Lipschitzian strongly pseudocontractive mapping. For any t ∈ (0,1), let xt be the unique fixed point of t f + (1− t)T . We prove that if T has a fixed point and E has uniformly Gâteaux differentiable norm, such that every nonempty closed bounded convex subset of...

متن کامل

Composite splitting algorithms for convex optimization

Article history: Received 21 April 2010 Accepted 6 June 2011 Available online xxxx

متن کامل

An Inexact Spingarn's Partial Inverse Method with Applications to Operator Splitting and Composite Optimization

We propose and study the iteration-complexity of an inexact version of the Spingarn’s partial inverse method. Its complexity analysis is performed by viewing it in the framework of the hybrid proximal extragradient (HPE) method, for which pointwise and ergodic iteration-complexity has been established recently by Monteiro and Svaiter. As applications, we propose and analyze the iteration-comple...

متن کامل

An iterative method for amenable semigroup and infinite family of non expansive mappings in Hilbert spaces

begin{abstract} In this paper, we introduce an iterative method for amenable semigroup of non expansive mappings and infinite family of non expansive mappings in the frame work of Hilbert spaces. We prove the strong convergence of the proposed iterative algorithm to the unique solution of a variational inequality, which is the optimality condition for a minimization problem. The results present...

متن کامل

An optimal method for stochastic composite optimization

This paper considers an important class of convex programming (CP) problems, namely, the stochastic composite optimization (SCO), whose objective function is given by the summation of general nonsmooth and smooth stochastic components. Since SCO covers non-smooth, smooth and stochastic CP as certain special cases, a valid lower bound on the rate of convergence for solving these problems is know...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 2005

ISSN: 0893-9659

DOI: 10.1016/j.aml.2004.09.013